new ant colony algorithm method based on mutation for fpga placement problem

many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optimization uses a similar mechanism to solve the optimization problem. usually the main difficulties of evolutionary algorithm for solving the optimization problem are: early convergence, loss of population diversity, and placing in a local minimum .therefore, it needs the way that preserves the variation and tries to avoid trapping in local minimum. in this paper by combining ant colony algorithm and mutation hybrid algorithms that leads to the better solution for optimization of fpga (field programmable gate array) placement problem is made. they are different types of swarm intelligence algorithm. after designing the algorithm, its parameters tuning have been done by solving several problems, and then the proposed methods have been compared with the other approaches. the results show that in most problems, the proposed hybrid method is able to obtain better solutions and makes fewer errors.